On Conceptually Simple Algorithms for Variants of Online Bipartite Matching
نویسندگان
چکیده
We present a series of results regarding conceptually simple algorithms for bipartite matching in various online and related models. We first consider a deterministic adversarial model. The best approximation ratio possible for a one-pass deterministic online algorithm is 1/2, which is achieved by any greedy algorithm. Dürr et al. [20] recently presented a 2-pass algorithm called Category-Advice that achieves approximation ratio 3/5. We extend their algorithm to multiple passes. We prove the exact approximation ratio for the k-pass Category-Advice algorithm for all k ≥ 1, and show that the approximation ratio converges to the inverse of the golden ratio 2/(1 + √ 5) ≈ 0.618 as k goes to infinity. The convergence is extremely fast — the 5-pass Category-Advice algorithm is already within 0.01% of the inverse of the golden ratio. We then consider a natural greedy algorithm in the online stochastic IID model – MinDegree. This algorithm is an online version of a well-known and extensively studied offline algorithm MinGreedy. MinGreedy is known to have excellent empirical performance, as well as excellent performance under various input models. Alas, recently it was shown to have approximation ratio 1/2 in the adversarial offline setting — the approximation ratio achieved by any greedy algorithm. We obtain a result in the online known IID model that, in spirit, is similar to the offline result, but the proof is different. Namely, we show that MinDegree cannot achieve an approximation ratio better than 1− 1/e, which is guaranteed by any consistent greedy algorithm in the known IID model. Finally, following the work in Besser and Poloczek [7], we depart from an adversarial or stochastic ordering and investigate a natural randomized algorithm (MinRanking) in the priority model. Although the priority model allows the algorithm to choose the input ordering in a general but well defined way, this natural algorithm cannot obtain the approximation of the Ranking algorithm in the ROM model.
منابع مشابه
Finding all maximally-matchable edges in a bipartite graph
We consider the problem of finding all maximally-matchable edges in a bipartite graph G = (V,E), i.e., all edges that are included in some maximum matching. We show that given any maximum matching in the graph, it is possible to perform this computation in linear time O(n + m) (where n = |V | and m = |E|). Hence, the time complexity of finding all maximally-matchable edges reduces to that of fi...
متن کاملFinding All Allowed Edges in a Bipartite Graph
We consider the problem of finding all allowed edges in a bipartite graph G = (V,E), i.e., all edges that are included in some maximum matching. We show that given any maximum matching in the graph, it is possible to perform this computation in linear time O(n + m) (where n = |V | and m = |E|). Hence, the time complexity of finding all allowed edges reduces to that of finding a single maximum m...
متن کاملOnline Bipartite Matching: A Survey and A New Problem
We study the problem of online bipartite matching, where algorithms have to draw irrevocable matchings based on an incomplete bipartite graph. Specifically, we focus on algorithms that maximize number of matchings (i.e. graphs with weight 0 or 1). First, competitive ratios of a well-studied problem (only one side of the bipartite graph is incomplete) with adversarial, random order and iid model...
متن کاملCSE 525 : Randomized Algorithms and Probabilistic Analysis Lecture 6 Lecturer : Anna
Online Bipartite Matching is a generalization of a well-known Bipartite Matching problem. In a Bipartite Matching, we a given a bipartite graph G = (L,R,E), and we need to find a matching M ⊆ E such that no edges in M have common endpoints. In the online version L is known, but vertices in R are arriving one at a time. When vertex j ∈ R arrives (with all its edges), we need to make an irreversi...
متن کاملAn Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
We study online variants of weighted bipartite matching on graphs and hypergraphs. In our model for online matching, the vertices on the right-hand side of a bipartite graph are given in advance and the vertices on the left-hand side arrive online in random order. Whenever a vertex arrives, its adjacent edges with the corresponding weights are revealed and the online algorithm has to decide whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1706.09966 شماره
صفحات -
تاریخ انتشار 2017